Claw-free t-perfect graphs can be recognised in polynomial time

A graph is called t-perfect if its stable set polytope is defined by non-negativity, edge and odd-cycle inequalities. We show that it can be decided in polynomial time whether a given claw-free graph is t-perfect

1923 - A.C.C Bible Lecture Week, Abilene Christian College

This is program for the 1923 Sixth Annual Bible Lecture Week at Abilene Christian College. Uploaded by Jackson Hager